Theorem Provers Based on the Quantifier Elimination Method
نویسندگان
چکیده
Here we describe quantifier elimination based theorem provers that were developed in GIS Group for Inteligent Systems on the Faculty of Mathematics, University of Belgrade; Specially, we present CRACKEN theorem prover for monadic logic, with potential applications.
منابع مشابه
Craig Interpolation and Access Interpolation with Clausal First-Order Tableaux
We show methods to extract Craig-Lyndon interpolants and access interpolants from clausal first-order tableaux as produced by automated first-order theorem provers based on model elimination, the connection method, the hyper tableau calculus and instance-based methods in general. Smullyan introduced an elegant method for interpolant extraction from “non-clausal” first-order tableaux. We transfe...
متن کاملQuantifier elimination for the theory of algebraically closed valued fields with analytic structure
The theory of algebraically closed non-Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this paper and which has far reaching consequences in the geometry of definable sets. This method of proving quantifier ...
متن کاملA Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications
Effective quantifier elimination procedures for first-order theories provide a powerful tool for generically solving a wide range of problems based on logical specifications. In contrast to general first-order provers, quantifier elimination procedures are based on a fixed set of admissible logical symbolswith an implicitly fixed semantics. This admits the use of sub-algorithms from symbolic co...
متن کاملCaching and Lemmaizing in Model Elimination Theorem Provers
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we report on work done to modify a model elimination theorem prover using two techniques, caching and lemmaizing, that have reduced by more than an order of magnitude the time required to find proofs of several problems and th...
متن کاملQuantifier Elimination and Provers Integration
We exploit quantifier elimination in the global design of combined decision and semi-decision procedures for theories over non-disjoint signatures, thus providing in particular extensions of Nelson-Oppen results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006